Performance bounds for peer-assisted live streaming
نویسندگان
چکیده
منابع مشابه
Performance Bounds for Peer-Assisted Live Streaming
Peer-assisted live streaming is a promising way for service providers to offer high-quality IPTV to consumers at reasonable cost. In peerassisted streaming, the peers (e.g., running on set-top boxes) exchange video chunks with one another, and receive additional data from the central server as needed. In this paper, we analyze how to provision resources for the streaming system, in terms of the...
متن کاملCooperative Push/Pull Protocols for Live Peer-Assisted Streaming
Video streaming is rapidly becoming one of the key services of the Internet. Most streaming is today “on demand” and delivered via unicast delivery; however, many applications require delivery to many end-users and the lack of ubiquitous IP multicast remains a weakness of the Internet. Given this scenario, the peer-to-peer (P2P) or peer-assisted communications is an appealing solution, especial...
متن کاملPeer-to-Peer Live Streaming
Live streaming is used in today’s Internet to broadcast TV channels and radio stations, usually by deploying streaming servers. Peer-to-peer applications have become popular in recent years to overcome the limitations of centralized servers. This thesis proposes StreamTorrent, a peer-to-peer-based live streaming protocol. In contrast to most protocols, StreamTorrent provides robustness, efficie...
متن کاملLive Streaming Performance of Peer-to-Peer Systems
In peer-to-peer (P2P) live streaming systems peers organize themselves in an overlay and contribute with their resources to help diffuse live content to all peers in a timely manner. The performance of such systems is usually characterized by the delay-loss curve, which quantifies the playback delay required for achieving a certain streaming quality, expressed as the chunk missing ratio at the ...
متن کاملPeer-to-Peer Live Streaming with MDC
We consider a peer-to-peer (P2P) live streaming network formed by unreliable nodes. The video is encoded into k MDC (Multiple-Description Coded) and t FEC (Forward Error Correction) streams. To achieve stream continuity notwithstanding node failures, the k + t streams are pushed to the nodes in parent-disjoint spanning trees. The challenge is how to construct these trees minimizing the worst-ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2008
ISSN: 0163-5999
DOI: 10.1145/1384529.1375493